// Tags:
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>

template <typename T>
inline T &read(T &x) {
  x = 0;
  bool f = false;
  short ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = true;
    ch = getchar();
  }
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ '0'), ch = getchar();
  if (f) x = -x;
  return x;
}

const int N = 155, K = 25, mod = 1e9 + 7;
int n, m, k, ans, f[N][N][K][K];

int dfs(int i, int j, int l, int h) {
  if (~f[i][j][l][h]) return f[i][j][l][h];
  if (i == n && j == m) return 1;
  int res = 0;
  if (i < n && l + 1 <= k) {
    res += dfs(i + 1, j, l + 1, std::max(0, h - 1));
    if (res >= mod) res -= mod;
  }
  if (j < m && h + 1 <= k) {
    res += dfs(i, j + 1, std::max(0, l - 1), h + 1);
    if (res >= mod) res -= mod;
  }
  return f[i][j][l][h] = res;
}

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen64("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen64("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("chess.in", "r", stdin);
  freopen("chess.out", "w", stdout);
#endif
#endif

  read(n), read(m), read(k);
  memset(f, -1, sizeof(f));
  printf("%d", dfs(0, 0, 0, 0));
  return 0;
}